Real-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility
نویسندگان
چکیده
This paper presents the results of a simulation study of a typical flexible manufacturing system that consists of seven machining centres, a loading and an unloading area, and six different part types. Owing to the existence of identical machining centres, the part types have alternative routings (their number varies between two and eight). One of the objectives of this work is to show how the following metaheuristics: ant colony optimisation, genetic algorithms, simulated annealing, tabu search, particle swarm optimisation and electromagnetism-like method, are adapted for solving the alternative routing selection problem in real time in order to reduce the congestion in the system by selecting a routing for each part among its alternative routings. The other goal is to highlight the impact of the real-time rescheduling of parts contained in the loading station on system performances when these metaheuristics are applied. The simulation results jugged by the production rate, machines and material handling utilisation rate show that for an overloaded system, the real-time rescheduling outperforms the case without rescheduling, but it has a negative impact on the work in process.
منابع مشابه
A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملA Real-time Methodology for Minimizing Flow Time in FMS with Full Routing Flexibility
A real time methodology with full routing flexibility is used for minimizing mean flow time in FMS. The combination of flexible alternative machines and flexible alternative operation sequences are used to obtain the full routing flexibility in flexible manufacturing system. Full routing flexibility offers decreasing cost, reducing waiting time and increasing efficiency. This paper presents an ...
متن کاملFlexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method
This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored a...
متن کاملA green transportation location-inventory-routing problem by dynamic regional pricing
Non-uniform distribution of customers in a region and variation of their maximum willingness to pay at distinct areas make regional pricing a practical method to maximize the profit of the distribution system. By subtracting the classic objective function, which minimizes operational costs from revenue function, profit maximization is aimed. A distribution network is designed by determining the...
متن کاملAmbulance routing in disaster response scenario considering different types of ambulances and semi soft time windows
This paper studies the ambulance routing problem (ARP) in disaster situations when a large number of injured people from various locations require receiving treatments and medical aids. In such circumstances, many people summoning the ambulances but the capacity and number of emergency vehicles are not sufficient to visit all the patients at the same time. Therefore, a pivotal issue is to manag...
متن کامل